Ant colony approach to constrained redundancy optimization in binary systems
نویسندگان
چکیده
منابع مشابه
Very Strongly Constrained Problems: an Ant Colony Optimization Approach
Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standard constructive heuristic and by previously constructed solutions. This paper is composed of three parts. The first one frames ACO in current trends of research on metaheuristics for combinatorial optimization. The secon...
متن کاملConstrained Ant Colony Optimization for Data Clustering
Processes that simulate natural phenomena have successfully been applied to a number of problems for which no simple mathematical solution is known or is practicable. Such meta-heuristic algorithms include genetic algorithms, particle swarm optimization and ant colony systems and have received increasing attention in recent years. This paper extends ant colony systems and discusses a novel data...
متن کاملApplying Ant Colony Optimization to Dynamic Binary-Encoded Problems
Ant colony optimization (ACO) algorithms have proved to be able to adapt to dynamic optimization problems (DOPs) when stagnation behaviour is addressed. Usually, permutation-encoded DOPs, e.g., dynamic travelling salesman problems, are addressed using ACO algorithms whereas binary-encoded DOPs, e.g., dynamic knapsack problems, are tackled by evolutionary algorithms (EAs). This is because of the...
متن کاملRelevance-redundancy feature selection based on ant colony optimization
The curse of dimensionality is a well-known problem in pattern recognition in which the number of patterns is smaller than the number of features in the datasets. Often, many of the features are irrelevant and redundant for the classification tasks. Therefore, the feature selection becomes an essential technique to reduce the dimensionality of the datasets. In this paper, unsupervised and multi...
متن کاملScheduling of ̄exible manufacturing systems: an ant colony optimization approach
The scheduling problem for ̄exible manufacturing systems (FMSs) has been attempted in this paper using the ant colony optimization (ACO) technique. Since the operation of a job in FMSs can be performed on more than one machine, the scheduling of the FMS is considered as a computationally hard problem. Ant algorithms are based on the foraging behaviour of real ants. The article deals with the an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2010
ISSN: 0307-904X
DOI: 10.1016/j.apm.2009.07.016